Optimal scheduling of slots with season segmentation

Scheduling algorithm to select $k$ optimal programme slots in television channels: A graph theoretic approach

In this paper, it is shown that all programmes of all television channels can be modelled as an interval graph. The programme slots are taken as the vertices of the graph and if the time duration of two programme slots have non-empty intersection, the corresponding vertices are considered to be connected by an edge. The number of viewers of a programme is taken as the weight of the vertex. A se...

Concerning the Length of Time Slots for Efficient Gang Scheduling

Applying gang scheduling can alleviate the blockade problem caused by exclusively used space-sharing strategies for parallel processing. However, the original form of gang scheduling is not practical as there are several fundamental problems associated with it. Recently many researchers have developed new strategies to alleviate some of these problems. Unfortunately, one important problem has n...

Season-Invariant Semantic Segmentation with a Deep Multimodal Network

Semantic scene understanding is a useful capability for autonomous vehicles operating in off-roads. While cameras are the most common sensor used for semantic classification, the performance of methods using camera imagery may suffer when there is significant variation between the train and testing sets caused by illumination, weather, and seasonal variations. On the other hand, 3D information ...

Adaptive Segmentation with Optimal Window Length Scheme using Fractal Dimension and Wavelet Transform

In many signal processing applications, such as EEG analysis, the non-stationary signal is often required to be segmented into small epochs. This is accomplished by drawing the boundaries of signal at time instances where its statistical characteristics, such as amplitude and/or frequency, change. In the proposed method, the original signal is initially decomposed into signals with different fr...

A Heuristic Algorithm for One-Machine Just-In-Time Scheduling Problem with Periodic Time Slots